Testing Probabilistic Processes: Can Random Choices Be Unobservable?

نویسندگان

  • Sonja Georgievska
  • Suzana Andova
چکیده

A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the internal choice is quantified with probabilities. However, ever since probabilities have been introduced in process semantics, it has been a challenge to preserve the unobservability of the random choice, while not violating the other laws of process theory and probability theory. This paper addresses this problem. It proposes two semantics for processes where the internal nondeterminism has been quantified with probabilities. The first one is based on the notion of testing, i.e. interaction between the process and its environment. The second one, the probabilistic ready trace semantics, is based on the notion of observability. Both are shown to coincide. They are also preserved under the standard operators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory

‎Given the importance of Markov chains in information theory‎, ‎the definition of conditional probability for these random processes can also be defined in terms of mutual information‎. ‎In this paper‎, ‎the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...

متن کامل

Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes

One of the most studied extensions of testing theory to nondeterministic and probabilistic processes yields unrealistic probabilities estimations that give rise to two anomalies. First, probabilistic testing equivalence does not imply probabilistic trace equivalence. Second, probabilistic testing equivalence differentiates processes that perform the same sequence of actions with the same probab...

متن کامل

Verification of Random Behaviours

We introduce abstraction in a probabilistic process algebra. The process algebra can be employed for specifying processes that exhibit both probabilistic and non-deterministic choices in their behaviours. Several rules and axioms are identified, allowing us to rewrite processes to less complex processes by removing redundant internal activity. Using these rules, we have successfully conducted a...

متن کامل

Probabilistic Programming Languages: Independent Choices and Deterministic Systems

Pearl [2000, p. 26] attributes to Laplace [1814] the idea of a probabilistic model as a deterministic system with stochastic inputs. Pearl defines causal models in terms of deterministic systems with stochastic inputs. In this paper, I show how deterministic systems with (independent) probabilistic inputs can also be seen as the basis of modern probabilistic programming languages. Probabilistic...

متن کامل

A Testing Equivalence for Reactive Probabilistic Processes

We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, external (deterministic) and internal (non-deterministic) choice. We propose an operational preorder and equivalence for processes based on testing. Milner’s button pushing experiments scenario is extended with random experime...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0907.1540  شماره 

صفحات  -

تاریخ انتشار 2009